Benchmarking Ontology-Based Query Rewriting Systems

Query rewriting is a prominent reasoning technique in ontology-based data access applications. A wide variety of query algorithms have been proposed recent years and implemented highly optimised systems. systems are complex software programs; even if based on provably correct algorithms, sophisticated optimisations make the more errors become likely to happen. In this paper, we present an algorithm that, given ontology as input, synthetically generates ``relevant'' test queries. Intuitively, each these queries can be used verify whether system correctly performs certain set ``inferences'', which traced back axioms input ontology. Furthermore, techniques that allow us determine unsound and/or incomplete for Our evaluation shows most publicly available incomplete, commonly benchmark ontologies; importantly, our revealed precise causes their correctness issues were then corrected feedback. Finally, since larger than existing benchmarks, hand-crafted queries, it also provides better understanding scalability behaviour system.